翻訳と辞書 |
highly irregular graph : ウィキペディア英語版 | highly irregular graph In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees. ==History==
Irregular graphs were initially characterized by Yousef Alavi, Gary Chartrand, Fan Chung, Paul Erdős, R L Graham, and Ortrud Oellerman.〔() Chartrand, Gary, Paul Erdos, and Ortrud R. Oellermann. "How to define an irregular graph." College Math. J 19.1 (1988): 36–42.〕 They were motivated to define the ‘opposite’ of a regular graph, a concept which has been thoroughly studied and well-understood.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「highly irregular graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|